Speaker: Boris Aronov Date: October, 2003

Topics: Mathematics, lectures

Speaker: Mohan Ramachandran Date: December 2003

Topics: Mathematics, lectures

Speaker: Bjorn Poonen

Topics: Mathematics, lecture

Speaker : Bjorn Poonen

Topics: Mathematics, lecture

Speaker: Joerg Rambau Date: July 2003

Topics: Mathematics, Lectures

Speaker: Joerg Rambau Date: July 2003

Topics: Mathematics, Lectures

Speaker: Van Vu Date: November 2003

Topics: Mathematics, lectures

Speaker: Sandro Graffi Date: May 2003

Topics: Mathematics, lectures

Speaker : Bridgitte Vallee Keywords: Analysis of algorithms; Euclidean algorithms; continued fraction expansion; dynamical systems; transfer operators; central and local limit theorems. Abstract: We show how dynamical analysis (=analysis of algorithms and dynamical systems) applies to the Euclidean context and provides a very precise distributional analysis of Euclidean algorithms. It proves that, in a strong sense, Euclidean algorithms are Gaussian.

Topics: Mathematics, lecture

Speaker: Ron Graham Date: August 2003

Topics: Mathematics, Lectures

Speaker : Alfredo Viola Keywords: Analysis of algorithms; hashing; linear probing; robin hood;exact distribution; buckets; individual displacements. Abstract: We present the distribution of the individual displacements in linear probing hashing with buckets using the robin hood heuristic. In the derivation we present anew sequence of numbers that are very useful study truncated recurrences. We study full tables and also we give results for fixed values of the size of the table and number...

Topics: Mathematics, lecture

Speaker: Wiqing Gu Date: Aug, 2003

Topics: Mathematics, lectures

Speaker : Marcos Kiwi Keywords : Analysis of algorithms; longest common subsequence; Sankoff & Mainville conjecture; longest increasing sequence; random graphs. Abstract : We consider the length L of the longest common subsequence of two randomly, uniformly and independently chosen n. We prove conjecture of Sankoff and Mainville from the early 80's concerning the asympotic (in k) behavior limiting constant.

Topics: Mathematics, lecture

Speaker: Jozsef Solymosi Date: November, 2003

Topics: Mathematics, lectures